Digital Logic
Q42.
Which one of the following expressions does NOT represent exclusive NOR of x and y?Q43.
The dual of a Boolean function F(x_{1},x_{2},...,x_{n}, +, \cdot , ' ) , written as F^{D}, is the same expression as that of F with + and \cdot swapped. F is said to be self-dual if F=F^{D}. The number of self-dual functions with n Boolean variables isQ44.
What is the minimal form of the Karnaugh map shown below? Assume that X denotes a don't care term.Q45.
Let \oplus denote the Exclusive OR (XOR) operation. Let '1' and '0' denote the binary constants. Consider the following Boolean Algebra for F over two variables P and Q. F(P,Q)=((1\oplus P)\oplus (P\oplus Q)) \oplus ((P\oplus Q) \oplus (Q\oplus 0)) The equivalent expression for F isQ48.
Consider the 4-to-1 multiplexer with two lines S1 and S0 given below. The minimal sum of-products form of the Boolean expression for the output F of the multiplexer isQ49.
A Boolean digital circuit is composed using two 4-input multiplexers (M1 and M2) and one 2-input multiplexer (M3) as shown in the figure. X0-X7 are the inputs of the multiplexers M1 and M2 and could be connected to either 0 or 1. The select lines of the multiplexers are connected to Boolean variables A, B and C as shown.Which one of the following set of values of (X0, X1, X2, X3, X4, X5, X6, X7) will realise the Boolean function \bar{A}+\bar{A}\cdot \bar{C}+A\cdot \bar{B}\cdot C ?Q50.
How many 2-input multiplexers are required to construct a 2^{10}-input multiplexer?